AllDifferent-based filtering for subgraph isomorphism

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AllDifferent-based filtering for subgraph isomorphism

The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with filtering techniques that aim at pruning branches that do not contain solutions. We introduce a new filtering algorithm based on local all different constraints. We show that this filtering is stronger than other exist...

متن کامل

Filtering for Subgraph Isomorphism

A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this problem. The main idea is to label every node with respect to its relationships with other nodes of the graph, and to define a partial order on these labels in order to express compatibility of labels for subgraph iso...

متن کامل

Lower Bounds for Subgraph Isomorphism

We consider the computational complexity of determining whether an Erdős-Rényi random graph contains a subgraph isomorphic to a fixed pattern, such as a clique or cycle of constant size. We give an overview of unconditional lower bounds for this problem, focusing on circuits and formulas in the AC 0 and monotone settings. 1 Background and preliminaries The subgraph isomorphism problem is the co...

متن کامل

Between Subgraph Isomorphism and Maximum Common Subgraph

When a small pattern graph does not occur inside a larger target graph, we can ask how to find “as much of the pattern as possible” inside the target graph. In general, this is known as the maximum common subgraph problem, which is much more computationally challenging in practice than subgraph isomorphism. We introduce a restricted alternative, where we ask if all but k vertices from the patte...

متن کامل

On Subgraph Isomorphism

Article explicitly expresses Subgraph Isomorphism by a polynomial size asymmetric linear system.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 2010

ISSN: 0004-3702

DOI: 10.1016/j.artint.2010.05.002